On the vanishing prime graph of solvable groups
نویسندگان
چکیده
منابع مشابه
Simple groups with the same prime graph as $D_n(q)$
Vasil'ev posed Problem 16.26 in [The Kourovka Notebook: Unsolved Problems in Group Theory, 16th ed.,Sobolev Inst. Math., Novosibirsk (2006).] as follows:Does there exist a positive integer $k$ such that there are no $k$ pairwise nonisomorphicnonabelian finite simple groups with the same graphs of primes? Conjecture: $k = 5$.In [Zvezdina, On nonabelian simple groups having the same prime graph a...
متن کاملQuasirecognition by Prime Graph of the Groups
Let G be a finite group. The prime graph Γ(G) of G is defined as follows: The set of vertices of Γ(G) is the set of prime divisors of |G| and two distinct vertices p and p′ are connected in Γ(G), whenever G has an element of order pp′. A non-abelian simple group P is called recognizable by prime graph if for any finite group G with Γ(G) = Γ(P ), G has a composition factor isomorphic to P . In [...
متن کامل2-recognizability of the simple groups $B_n(3)$ and $C_n(3)$ by prime graph
Let $G$ be a finite group and let $GK(G)$ be the prime graph of $G$. We assume that $ngeqslant 5 $ is an odd number. In this paper, we show that the simple groups $B_n(3)$ and $C_n(3)$ are 2-recognizable by their prime graphs. As consequences of the result, the characterizability of the groups $B_n(3)$ and $C_n(3)$ by their spectra and by the set of orders of maximal abelian subgroups are ...
متن کامل2-quasirecognizability of the simple groups B_n(p) and C_n(p) by prime graph
Let G be a finite group and let $GK(G)$ be the prime graph of G. We assume that $n$ is an odd number. In this paper, we show that if $GK(G)=GK(B_n(p))$, where $ngeq 9$ and $pin {3,5,7}$, then G has a unique nonabelian composition factor isomorphic to $B_n(p)$ or $C_n(p)$ . As consequences of our result, $B_n(p)$ is quasirecognizable by its spectrum and also by a new proof, the ...
متن کاملOn some Frobenius groups with the same prime graph as the almost simple group ${ {bf PGL(2,49)}}$
The prime graph of a finite group $G$ is denoted by $Gamma(G)$ whose vertex set is $pi(G)$ and two distinct primes $p$ and $q$ are adjacent in $Gamma(G)$, whenever $G$ contains an element with order $pq$. We say that $G$ is unrecognizable by prime graph if there is a finite group $H$ with $Gamma(H)=Gamma(G)$, in while $Hnotcong G$. In this paper, we consider finite groups with the same prime gr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Group Theory
سال: 2010
ISSN: 1433-5883,1435-4446
DOI: 10.1515/jgt.2009.046